MacWilliams identities and coordinate partitions
نویسندگان
چکیده
منابع مشابه
Fourier-reflexive partitions and MacWilliams identities for additive codes
A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition coincides the primal partition. Such partitions permit MacWilliams identities for the partition enumerators of additive codes. It is shown that dualization c...
متن کاملCharacter sums and MacWilliams identities
We show that certain character sums are intimately connected with MacWilliams identities for linear poset codes as well as usual linear codes. We also illustrate in some two poset codes that this method gives much shorter proofs than the ones using discrete Poisson summation formula. © 2004 Elsevier B.V. All rights reserved. MSC: primary 11L03; 94B60; secondary 94B05
متن کاملMacWilliams Identities and Matroid Polynomials
We present generalisations of several MacWilliams type identities, including those by Kløve and Shiromoto, and of the theorems of Greene and Barg that describe how the Tutte polynomial of the vector matroid of a linear code determines the rth support weight enumerators of the code. One of our main tools is a generalisation of a decomposition theorem due to Brylawski.
متن کاملMacWilliams Identities for $m$-tuple Weight Enumerators
Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of m-tuple support enumerators. We prove a generalization of theorems of Britz and of Ray-Chaudhuri and Siap, which build on earlier work of Kløve, Shiromoto, Wan, and others. W...
متن کاملPolynomial identities for partitions
For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1995
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)00106-a